- chebyshev norm
- • čebisovljeva norma
English-Serbian dictionary. 2013.
English-Serbian dictionary. 2013.
Chebyshev polynomials — Not to be confused with discrete Chebyshev polynomials. In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre s formula and which can be defined… … Wikipedia
Chebyshev distance — This article is about the finite dimensional vector space distance. For the function space norm, see uniform norm. a b c d e f g h … Wikipedia
Chebyshev iteration — In numerical linear algebra, the Chebyshev iteration is an iterative method for determining the solutions of a system of linear equations. The method is named after Russian mathematician Pafnuty Chebyshev. Chebyshev iteration avoids the… … Wikipedia
Chebyshev — Pafnuti L. Tschebyschow Mechanik des Tschebyschow Parallelogramms Pafnuti Lwowitsch Tschebyschow (russisch Пафнутий Львович Чебышёв, wiss … Deutsch Wikipedia
Uniform norm — This article is about the function space norm. For the finite dimensional vector space distance, see Chebyshev distance. The black square is the set of points in R2 where the sup norm equals a fixed non zero constant. In mathematical analysis,… … Wikipedia
Discrete Chebyshev polynomials — Not to be confused with Chebyshev polynomials. In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, introduced by Pafnuty Chebyshev (1864) and… … Wikipedia
Pafnuty Chebyshev — Pafnuti L. Tschebyschow Mechanik des Tschebyschow Parallelogramms Pafnuti Lwowitsch Tschebyschow (russisch Пафнутий Львович Чебышёв, wiss … Deutsch Wikipedia
Pafnuty Lvovich Chebyshev — Pafnuti L. Tschebyschow Mechanik des Tschebyschow Parallelogramms Pafnuti Lwowitsch Tschebyschow (russisch Пафнутий Львович Чебышёв, wiss … Deutsch Wikipedia
Window function — For the term used in SQL statements, see Window function (SQL) In signal processing, a window function (also known as an apodization function or tapering function[1]) is a mathematical function that is zero valued outside of some chosen interval … Wikipedia
Classical orthogonal polynomials — In mathematics, the classical orthogonal polynomials are the most widely used orthogonal polynomials, and consist of the Hermite polynomials, the Laguerre polynomials, the Jacobi polynomials together with their special cases the ultraspherical… … Wikipedia
Remez algorithm — The Remez algorithm (sometimes also called Remes algorithm, Remez/Remes exchange algorithm), published by Evgeny Yakovlevich Remez in 1934 [E. Ya. Remez, Sur la détermination des polynômes d approximation de degré donnée , Comm. Soc. Math.… … Wikipedia